Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
نویسندگان
چکیده
منابع مشابه
Graph partitioning for scalable distributed graph computations
Inter-node communication time constitutes a significant fraction of the execution time of graph algorithms on distributed-memory systems. Global computations on large-scale sparse graphs with skewed degree distributions are particularly challenging to optimize for, as prior work shows that it is difficult to obtain balanced partitions with low edge cuts for these graphs. In this work, we attemp...
متن کاملTask-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
Quantum molecular dynamics (QMD) simulations are highly accurate, but they are computationally expensive due to the calculation of the ground-state electronic density matrix P via an O(N) diagonalization. Second-order spectral projection (SP2) is an efficient O(N) alternative to obtain P from a Hamiltonian matrix H. This poster presents a dataparallel version of the SP2 algorithm that uses an u...
متن کاملDistributed Evolutionary Graph Partitioning
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partiti...
متن کاملScalable Partitioning for Parallel Position Based Dynamics
We introduce a practical partitioning technique designed for parallelizing Position Based Dynamics, and exploiting the ubiquitous multi-core processors present in current commodity GPUs. The input is a set of particles whose dynamics is influenced by spatial constraints. In the initialization phase, we build a graph in which each node corresponds to a constraint and two constraints are connecte...
متن کاملDistributed Edge Partitioning for Graph Processing
The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and distributed algorithms has greatly increased. Appropriately partitioning the graph as a preprocessing step can improve the degree of parallelism of its analysis. A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12090187